package datastruct;

import java.util.Comparator;
import java.util.PriorityQueue;

public class MedianSlidingWindow {

    /**
     * LeetCode T480 滑动窗口中位数
     * @param args
     */
    public static void main(String[] args) {

    }

    public double[] medianSlidingWindow(int[] nums, int k) {
        return null;
    }
}
class DualHeap{
    //存放小的值，大根堆
    PriorityQueue<int[]> smallHeap = new PriorityQueue<>(new Comparator<int[]>() {
        @Override
        public int compare(int[] o1, int[] o2) {
            if (o1[0] != o2[1])
                return 0;
            return 0;
        }
    });
    //存放大的值
    PriorityQueue<int[]> largeHeap = new PriorityQueue<>();
}
